Topological indices of the bipartite Kneser graph Hn,k
نویسندگان
چکیده
منابع مشابه
Distance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملBipartite Kneser Graphs are Hamiltonian
The Kneser graph K(n, k) has as vertices all k-element subsets of [n] := {1, 2, . . . , n} and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph H(n, k) has as vertices all k-element and (n−k)-element subsets of [n] and an edge between any two vertices where one is a subset of the other. It has long been conjectured that all connected Kneser graphs and bipar...
متن کاملUsing Topological Methods to Force Maximal Complete Bipartite Subgraphs of Kneser Graphs
Santa likes to run a lean and efficient toy-making operation. He also likes to keep up with the latest math developments. So naturally, when Santa was building a new factory a few years back, he designed an interesting factory and method for assigning workers to toys that was based on a recent article he read in the Monthly ??. Here were some of Santa’s constraints. As it turns out, each toy re...
متن کاملdistance-based topological indices and double graph
let $g$ be a connected graph, and let $d[g]$ denote the double graph of $g$. in this paper, we first derive closed-form formulas for different distance based topological indices for $d[g]$ in terms of that of $g$. finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملTopological Indices of the Total Graph of Subdivision Graphs
In this paper, we compute topological indices of the total graphs of the tadpole graphs, wheel graphs and ladder graphs using the subdivision concept, which extend the results of Ranjini et al. (2011).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2014
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1410989m